Linear Time Algorithms or Hamiltonian Problems on (Claw, Net)-Free Graphs
نویسندگان
چکیده
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the input is restricted to (claw,net)-free graphs. These graphs enjoy those interesting structural properties.
منابع مشابه
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the inpu...
متن کاملOn Hamiltonicity of {claw, net}-free graphs
An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with s, t ∈ V (G) and e ∈ E(G) to have (1) a Hamiltonian s-path, (2) a Hamiltonian st-path, (3) a Hamiltonian sand st-paths containing e when G has connectivity one, and (4) a Hamiltonian cycle containi...
متن کاملOn Hamiltonicity of Claw- And Net-free Graphs
An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with s, t ∈ V (G) and e ∈ E(G) to have (1) Hamiltonian s-path, (2) a Hamiltonian st–path, (3) a Hamiltonian sand st-paths containing e when G has connectivity one, and (4) a Hamiltonian cycle containing...
متن کاملOn linear and circular structure of (claw, net)-free graphs
We prove that every (claw, net)-free graph contains an induced doubly dominating cycle or a dominating pair. Moreover, using LexBFS we present a linear time algorithm which, for a given (claw, net)-free graph, 3nds either a dominating pair or an induced doubly dominating cycle. We show also how one can use structural properties of (claw, net)-free graphs to solve e4ciently the domination, indep...
متن کاملOn some intriguing problems in hamiltonian graph theory--a survey
We survey results and open problems in hamiltonian graph theory centred around three themes: regular graphs, t-tough graphs, and claw-free graphs.
متن کامل